Modulo Scheduling with Isomorphic Control Transformations

نویسندگان

  • JEANNE WARTER
  • Wen-mei W. Hwu
چکیده

This dissertation addresses the complexities involved with scheduling in the presence of conditional branches. This is a particularly important problem for processors that execute multiple operations per cycle and are not fully utilized by local scheduling techniques. Since conditional branches introduce multiple execution paths, it is diicult for a global scheduler to keep track of the various paths and to select the appropriate operations to schedule. A new approach t o global instruction scheduling is presented that uses Isomorphic Control Transformations ICTs. If-conversion is used to convert an acyclic control ow graph into a large basic block o r h yper-block. Local scheduling techniques which are well-known and widely supported can then be applied to schedule operations. After scheduling, the control ow graph is regenerated using Reverse If-Conversion. One well-known local scheduling based technique is Modulo Scheduling. Modulo Scheduling is a software pipelining technique that eeectively schedules loops for high-performance processors. This dissertation highlights the beneets of Modulo Scheduling over other software pipelining techniques based on global scheduling. The ICTs are applied to Modulo Scheduling to schedule loops with conditional branches. Experimental results show that this approach allows more exible scheduling and thus better performance than Modulo Scheduling with Hierarchical Reduction. Modulo Scheduling with ICTs targets processors with no or limited support for conditional execution such as superscalar processors. However, in processors that do not require instruction set compatibility, support for Predicated Execution can be used. This dissertation shows that Modulo Scheduling with Predicated Execution has better performance iii and lower code expansion than Modulo Scheduling with ICTs on processors without special hardware support. iv DEDICATION To m y family, new and old. v ACKNOWLEDGMENTS First and foremost, I would like t o a c knowledge my advisor, Professor Wen-mei W. Hwu, for his intellectual, nancial, professional, and emotional support. I value his advice greatly and look forward to applying what I have learned from him as I start my career as a professor. Next, I would like t o a c knowledge the support of my Ph.D. committee members. Throughout my y ears in graduate school, Professor Michael Loui has provided me with valuable guidance. Furthermore, I have a deep respect for his commitment to excellence in education. I would also like t o a c knowledge Professors Janak Patel and David Kuck for helping me to focus my research. Finally, I w ould like t o a c …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Infinitesimal Conformal Transformations of the Tangent Bundles with the Generalized Metric

Let  be an n-dimensional Riemannian manifold, and  be its tangent bundle with the lift metric. Then every infinitesimal fiber-preserving conformal transformation  induces an infinitesimal homothetic transformation on .  Furthermore,  the correspondence   gives a homomorphism of the Lie algebra of infinitesimal fiber-preserving conformal transformations on  onto the Lie algebra of infinitesimal ...

متن کامل

Optimization of Logic Programs with Dynamic Scheduling Mar a Garc a De

Dynamic scheduling increases the expressive power of logic programming languages, but also introduces some overhead. In this paper we present two classes of program transformations designed to reduce this additional overhead, while preserving the operational semantics of the original programs , modulo ordering of literals woken at the same time. The rst class of transformations simpliies the de...

متن کامل

Optimization of Logic Programs with Dynamic Scheduling

Dynamic scheduling increases the expressive power of logic programming languages, but also introduces some overhead. In this paper we present two classes of program transformations designed to reduce this additional overhead, while preserving the operational semantics of the original programs, modulo ordering of literals woken at the same time. The first class of transformations simplifies the ...

متن کامل

Some Observations on Dirac Measure-Preserving Transformations and their Results

Dirac measure is an important measure in many related branches to mathematics. The current paper characterizes measure-preserving transformations between two Dirac measure spaces or a Dirac measure space and a probability measure space. Also, it studies isomorphic Dirac measure spaces, equivalence Dirac measure algebras, and conjugate of Dirac measure spaces. The equivalence classes of a Dirac ...

متن کامل

Offset Pipelined Scheduling, Placement, and Routing for Branching CGRAs

Modulo counter based control of coarse-grained reconfigurable arrays (CGRAs) makes them inefficient for applications with multiple execution modes. This work presents an enhanced architecture and accompanying tool chain that add branching control flow to CGRAs. Offset pipelined scheduling leads to a challenging routing problem. The EveryTime router presented here is an architecture adaptive app...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993